Optimal Policies for a Generational Garbage Collector with Tenuring Threshold
نویسندگان
چکیده
It is an important problem to determine the tenuring threshold to meet the pause time goal for a generational garbage collector. From such viewpoint, this paper proposes two stochastic models based on the working schemes of a generational garbage collector: One is random minor collection which occurs at a nonhomogeneous Poisson process and the other is periodic minor collection which occurs at periodic times. Since the cost suffered for minor collection increases, as the amount of surviving objects accumulates, tenuring minor collection should be made at some tenuring threshold. Using the techniques of cumulative processes and reliability theory, expected cost rates with tenuring threshold are obtained, and optimal policies which minimize them are discussed analytically and computed numerically.
منابع مشابه
Studies on Tenuring Collection Times for a Generational Garbage Collector∗
It is an important problem to analyze the collection costs and determine tenuring collection times to meet the pause time goal for a generational garbage collector. From such viewpoints, this paper analyzes the costs suffered for collections according to the working schemes firstly, and then, proposes one garbage collection model. Garbage collections occur at a nonhomogeneous Poisson process, a...
متن کاملOptimal Tenuring Collection Times for a Generational Garbage Collector based on Continuous Damage Model
_________________________________________________ *Corresponding author’s email: [email protected] 539 Optimal Tenuring Collection Times for a Generational Garbage Collector based on Continuous Damage Model XUFENG ZHAO 2 and TOSHIO NAKAGAWA 1 School of Economics and Management, Nanjing University of Technology 30 Puzhu Road, Nanjing 211816, China 2 Graduate School of Management and In...
متن کاملGenerational Garbage Collection for Lazy Functional Languages without Temporary Space Leaks
Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation, works well in strict languages. In a lazy language, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...
متن کاملGenerational Garbage Collection without Temporary Space Leaks for Lazy Functional Languages
Generational garbage collection is an established method for creating eecient garbage collectors. Even a simple implementation where all nodes that survive one garbage collection are tenured, i.e., moved to an old generation , works well in strict languages. In lazy languages, however, such an implementation can create severe temporary space leaks. The temporary space leaks appear in programs t...
متن کاملCombining Single-Space and Two-Space Compacting Garbage Collectors
The garbage collector presented in this paper makes use of two well known compaction garbage collection algorithms with very diierent performance characteristics: Cheney's two-space copying collector and Jon-ker's single-space sliding compaction collector. We propose a scheme which allows either collector to be used. The run-time memory requirements of the program being executed are used to det...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010